#include <vector>

using namespace std;

class Solution {
public:

    // 309. 买卖股票的最佳时机含冷冻期
    // https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/
    int maxProfit(vector<int>& prices) {
        int n = prices.size();
        vector<vector<int>> dp(n, vector<int>(3));
        dp[0][0] = -prices[0];

        for (int i = 1; i<n; ++i)
        {
            dp[i][0] = max(dp[i-1][0], dp[i-1][1]-prices[i]);
            dp[i][1] = max(dp[i-1][1], dp[i-1][2]);
            dp[i][2] = dp[i-1][0] + prices[i];
        }

        return max(dp[n-1][1], dp[n-1][2]);
    }

    // 714. 买卖股票的最佳时机含手续费
    // https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/
    int maxProfit(vector<int>& prices, int fee) {
        int n = prices.size();
        vector<vector<int>> dp(n, vector<int>(2));
        dp[0][0] = -prices[0];

        for (int i = 1; i<n; ++i)
        {
            dp[i][0] = max(dp[i-1][0], dp[i-1][1] - prices[i]);
            dp[i][1] = max(dp[i-1][1], dp[i-1][0]+prices[i]-fee);
        }

        return dp[n-1][1];
    }
};